package advanced进阶;

public class MaoPao{
    public static void main(String args[]){
        int []arr =new int[]{1,5,6,4,3};
        //打印原数组
        System.out.println("排序前");
        //for(int i = 0;i<arr.length;i++){
          //  System.out.print(arr[i] + " ");
        //}
        for(int i : arr){
            System.out.print(i + " ");
        }
        System.out.println();//换行

        //打印排序后数组
        for(int i = 0;i<arr.length - 1;i++){
            for(int j = 0;j<arr.length - 1 - i;j++){
                if(arr[j]>arr[j+1]){
                    int temp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = temp;
                }
            }
        }
        System.out.println("排序后");
        for(int i = 0;i<arr.length;i++) {
            System.out.print(arr[i] + " ");
        }
    }
}
